A Berry–Esseen theorem and Edgeworth expansions for uniformly elliptic inhomogeneous Markov chains

نویسندگان

چکیده

We prove a Berry–Esseen theorem and Edgeworth expansions for partial sums of the form $$\displaystyle S_N=\sum \nolimits _{n=1}^{N}f_n(X_n,X_{n+1})$$ , where $$\{X_n\}$$ is uniformly elliptic inhomogeneous Markov chain $$\{f_n\}$$ sequence bounded functions. The holds without additional assumptions, while order 1 hold when irreducible, which an optimal condition. For higher expansions, we then focus on two situations. first essential supremum $$f_n$$ $$O(n^{-{\beta }})$$ some $${\beta }\in (0,1/2)$$ . In this case it turns out that any $$r<\frac{1}{1-2{\beta }}$$ hold, condition optimal. second chains compact Riemannian manifold. When are Lipschitz continuous show $$S_N$$ admits all orders. Hölder with exponent $${\alpha (0,1)$$ orders $$r<\frac{1+{\alpha }}{1-{\alpha continues functions }<1$$ our results new also homogeneous single functional $$f=f_n$$ fact, even in case.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small time Edgeworth-type expansions for weakly convergent nonhomogeneous Markov chains

We consider triangular arrays of Markov chains that converge weakly to a diffusion process. Second order Edgeworth type expansions for transition densities are proved. The paper differs from recent results in two respects. We allow nonhomogeneous diffusion limits and we treat transition densities with time lag converging to zero. Small time asymptotics are motivated by statistical applications ...

متن کامل

Mixing Times for Uniformly Ergodic Markov Chains

Consider the class of discrete time, general state space Markov chains which satist)' a "'uniform ergodicity under sampling" condition. There are many ways to quantify the notion of "mixing time", i.e., time to approach stationarity from a worst initial state. We prove results asserting equivalence (up to universal constants) of different quantifications of mixing time. This work combines three...

متن کامل

A regeneration proof of the central limit theorem for uniformly ergodic Markov chains

E h(x)π(dx). Ibragimov and Linnik (1971) proved that if (Xn) is geometrically ergodic, then a central limit theorem (CLT) holds for h whenever π(|h|) < ∞, δ > 0. Cogburn (1972) proved that if a Markov chain is uniformly ergodic, with π(h) < ∞ then a CLT holds for h. The first result was re-proved in Roberts and Rosenthal (2004) using a regeneration approach; thus removing many of the technicali...

متن کامل

A Regeneration Proof of the Central Limit Theorem for Uniformly Ergodic Markov Chains

Abstract Central limit theorems for functionals of general state space Markov chains are of crucial importance in sensible implementation of Markov chain Monte Carlo algorithms as well as of vital theoretical interest. Different approaches to proving this type of results under diverse assumptions led to a large variety of CTL versions. However due to the recent development of the regeneration t...

متن کامل

Taylor Series Expansions for Stationary Markov Chains

We study Taylor series expansions of stationary characteristics of general-state-space Markov chains. The elements of the Taylor series are explicitly calculated and a lower bound for the radius of convergence of the Taylor series is established. The analysis provided in this paper applies to the case where the stationary characteristic is given through an unbounded sample performance function ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability Theory and Related Fields

سال: 2022

ISSN: ['0178-8051', '1432-2064']

DOI: https://doi.org/10.1007/s00440-022-01177-2